Eecient and Non-interactive Non-malleable Commitment

We present new constructions of non-malleable commitment schemes, in the public parameter model (where a trusted party makes parameters available to all parties), based on the discrete logarithm or RSA assumptions. The main features of our schemes are: they achieve near-optimal communication for arbitrarily-large messages and are non-interactive. Previous schemes either required (several rounds of) interaction or focused on achieving non-malleable commitment based on general assumptions and were thus eecient only when committing to a single bit. Although our main constructions are for the case of perfectly-hiding commitment, we also present a communication-eecient, non-interactive commitment scheme (based on general assumptions) that is perfectly binding.